Reflection principles and provability algebras in formal arithmetic
نویسنده
چکیده
We study reflection principles in fragments of Peano arithmetic and their applications to the questions of comparison and classification of arithmetical theories. Bibliography: 95 items.
منابع مشابه
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in arithmetic [9, 5, 8]. This system plays an important role in some recent applications of provability algebras in proof theory [2, 3]. However, an obstacle in the study of GLP is that it is incomplete w.r.t. any class ...
متن کاملProof theory and mathematical meaning of paraconsistent C-systems
A proof theoretic analysis and new arithmetical semantics are proposed for some paraconsistent C-systems, which are a relevant subclass of Logics of Formal Inconsistency (LFIs) introduced by W. A. Carnielli et al. [8,9]. The sequent versions BC, CI,CIL of the systems bC, Ci, Cil presented in [8,9] are introduced and examined. BC, CI,CIL admits the cut elimination property and, in general, a wea...
متن کاملVeblen hierarchy in the context of provability algebras
We study an extension of Japaridze’s polymodal logic GLP with transfinitely many modalities and develop a provability-algebraic ordinal notation system up to the ordinal Γ0. In the papers [1, 2] a new algebraic approach to the traditional prooftheoretic ordinal analysis was presented based on the concept of graded provability algebra. The graded provability algebra of a formal theory T is its L...
متن کاملΠ1-ordinal analysis beyond first-order arithmetic
In this paper we give an overview of an essential part of a Π1 ordinal analysis of Peano Arithmetic (PA) as presented by Beklemishev ([2]). This analysis is mainly performed within the polymodal provability logic GLPω. We reflect on ways of extending this analysis beyond PA. A main difficulty in this is to find proper generalizations of the so-called Reduction Property. The Reduction Property r...
متن کاملA Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic
We study a propositional polymodal provability logic GLP introduced by G. Japaridze. The previous treatments of this logic, due to Japaridze and Ignatiev (see [11, 7]), heavily relied on some non-finitary principles such as transfinite induction up to ε0 or reflection principles. In fact, the closed fragment of GLP gives rise to a natural system of ordinal notation for ε0 that was used in [1] f...
متن کامل